Testing from a Finite-State Machine: Extending Invertibility to Sequences
نویسنده
چکیده
When testing a system modelled as a nite state machine it is de sirable to minimize the e ort required Yang and Ural demon strate that it is possible to utilize test sequence overlap in order to reduce the test e ort and Hierons represents this overlap by us ing invertible transitions In this paper invertibility will be extended to sequences in order to further reduce the test e ort and encapsulate a more general type of test sequence overlap It will also be shown that certain properties of invertible sequences can be used in the generation of state identi cation sequences
منابع مشابه
Invertibility of Discrete-Event Dynamic Systems
In this paper we consider a class of Discrete-Event Dynamic Systems (DEDS) modeled as finite-state automata in which only some of the transition events are directly observed. An invertible DEDS is one for which it is possible to reconstruct the entire event string from the observation of the output string. The dynamics of invertibility are somewhat complex, as ambiguities in unobservable events...
متن کاملTest Generation for a System of Communicating Finite State Machines
A system of communicating finite state machines (SCFSM) is a usual design model of a complicated system composed of multiple communicating components. SCFSM testing usually depends on finite state machine (FSM) testing as an SCFSM can be converted to an equivalent FSM. SCFSM testing, however, should consider the properties of SCFSMs which are different from those of component FSMs. This paper p...
متن کاملLeft invertibility of discrete-time output-quantized systems: the linear case with finite inputs
This paper studies left invertibility of discrete-time linear outputquantized systems. Quantized outputs are generated according to a given partition of the state-space, while inputs are sequences on a finite alphabet. Left invertibility, i.e. injectivity of I/O map, is reduced to left D-invertibility, under suitable conditions. While left invertibility takes into account membership to sets of ...
متن کاملRestricted cascade and wreath products of fuzzy finite switchboard state machines
A finite switchboard state machine is a specialized finite state machine. It is built by binding the concepts of switching state machines and commutative state machines. The main purpose of this paper is to give a specific algorithm for fuzzy finite switchboard state machine and also, investigates the concepts of switching relation, covering, restricted cascade products and wreath products of f...
متن کاملLeft invertibility of output-quantized MISO linear systems
This paper studies left invertibility of single-output discrete-time quantized linear systems. Quantized outputs are generated according to a given partition of the state-space, while inputs are sequences on a finite alphabet. Left invertibility deals with the possibility of recovering unknown inputs from the only knowledge of the outputs. It is reduced, under suitable conditions, to left D-inv...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Comput. J.
دوره 40 شماره
صفحات -
تاریخ انتشار 1997